Normal structure $f$ satisfying $f^{3}+f=0$
نویسندگان
چکیده
منابع مشابه
Submanifolds of F - Structure Manifold Satisfying Fk + ( − ) K + 1 F = 0
The purpose of this paper is to study invariant submanifolds of an ndimensional manifold M endowed with an F -structure satisfying FK + (−)K+1F = 0 and FW + (−)W+1F ≠ 0 for 1 < W < K, where K is a fixed positive integer greater than 2. The case when K is odd (≥ 3) has been considered in this paper. We show that an invariant submanifold M̃ , embedded in an F -structure manifold M in such a way th...
متن کاملOn CR - Structures and F − Structure Satisfying F 2 K + P + FP = 0
Abstract CR−submanifolds of a kahlerian manifold have been defined by A. Bejancu[1], and are now being studied by various authors, see [2] and [3]. The theory of F−structure was devolped by Yano [4], Yano and Ishihara [5], Goldberg [6] and among others. The purpose of this paper is to show a relationship between CR−structures and F−structure satisfying F 2K+P + FP = 0, where K is a fixed intege...
متن کاملConnectionist F - structure Transfer
A traditional transfer system in machine translation maps between language structures and an intermediate representation. Our connectionist transfer system maps from f-structures of one language to f-structures of another language. It encodes the intermediate representation implicitly in neural networks' activation patterns. The system is learnable, therefore it does not need any e ort in handc...
متن کاملSimultaneously Satisfying Linear Equations Over $\mathbb{F}_2$: MaxLin2 and Max-$r$-Lin2 Parameterized Above Average
In the parameterized problem MAXLIN2-AA[k], we are given a system with variables x1, . . . , xn consisting of equations of the form ∏ i∈I xi = b, where xi, b ∈ {−1, 1} and I ⊆ [n], each equation has a positive integral weight, and we are to decide whether it is possible to simultaneously satisfy equations of total weight at least W/2+ k, where W is the total weight of all equations and k is the...
متن کاملTreebank vs. Xbar-based Automatic F-structure Annotation Treebank vs. Xbar-based Automatic F-structure Annotation
Manual, large scale (computational) grammar development is time consuming, expensive and requires lots of linguistic expertise. More recently, a number of alternatives based on treebank resources (such as Penn-II, Susanne, AP treebank) have been explored. The idea is to automatically \induce" or rather read oo (P)CFG grammars from the parse annotated treebank resources and to use the treebank g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kodai Mathematical Journal
سال: 1966
ISSN: 0386-5991
DOI: 10.2996/kmj/1138845162